Learning from minimum entropy queries in a large committee machine
نویسندگان
چکیده
منابع مشابه
Minimum entropy queries for linear students learning nonlinear rules
We study the fundamental question of how query learn ing performs in imperfectly learnable problems where the student can only learn to approximate the teacher Considering as a prototypical sce nario a linear perceptron student learning a general nonlinear perceptron teacher we nd that queries for minimum entropy in student space i e maximum information gain lead to the same improvement in gene...
متن کاملStatistical Mechanics of Learning in a Large Committee Machine
In a We use statistical mechanics to study generalization in large committee machines. For an architecture with nonoverlapping receptive fields a replica calculation yields the generalization error in the limit of a large number of hidden units. For continuous weights the generalization error falls off asymptotically inversely proportional to Q, the number of training examples per weight. For b...
متن کاملGeneralization in a Large Committee Machine
We study generalization in a committee machine with non{overlapping receptive elds trained to implement a function of the same structure. Using the replica method, we calculate the generalization error in the limit of a large number of hidden units. For continuous weights the generalization error falls oo asymptotically inversely proportional to , the number of training examples per weight. For...
متن کاملLearning from Partial Labels with Minimum Entropy
ASSOCIE A :. Institut de Finance Mathématique de Montréal (IFM 2). Laboratoires universitaires Bell Canada. Réseau de calcul et de modélisation mathématique [RCM 2 ]. Réseau de centres d'excellence MITACS (Les mathématiques des technologies de l'information et des systèmes complexes) Les cahiers de la série scientifique (CS) visent à rendre accessibles des résultats de recherche effectuée au CI...
متن کاملOn-line Learning in the Committee Machine
The dynamics of learning from examples in the K = 3 nonoverlapping committee machine with single presentation of examples is studied. The optimal algorithm, in the sense of mean generalization, is obtained from a variational analysis of the diierential equations which describe the dynamics. The agreement of the theoretical predictions and the results of numerical simulations is excellent. The o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 1996
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.53.r2060